Tootfinder

This https://arxiv.org/abs/2203.11155 has been replaced.
link: https://scholar.google.com/scholar?q=a

Quantum Neural Network with Density Matrix for Question Answering and Classical Image Classification
Quantum density matrix represents all the information of the entire quantum system, and novel models of meaning employing density matrices naturally model linguistic phenomena such as hyponymy and linguistic ambiguity, among others in quantum question answering tasks. Naturally, we argue that applying the quantum density matrix into classical Question Answering (QA) tasks can show more effective performance. Specifically, we (i) design a new mechanism based on Long Short-Term Memory (LSTM) to a…

PVF (Parameter Vulnerability Factor): A Quantitative Metric Measuring AI Vulnerability and Resilience Against Parameter Corruptions
Xun Jiao, Fred Lin, Harish D. Dixit, Joel Coburn, Abhinav Pandey, Han Wang, Jianyu Huang, Venkat Ramesh, Wang Xu, Daniel Moore, Sriram Sankar
https://arxiv.org/abs/2405.01741

PVF (Parameter Vulnerability Factor): A Quantitative Metric Measuring AI Vulnerability and Resilience Against Parameter Corruptions
Reliability of AI systems is a fundamental concern for the successful deployment and widespread adoption of AI technologies. Unfortunately, the escalating complexity and heterogeneity of AI hardware systems make them inevitably and increasingly susceptible to hardware faults (e.g., bit flips) that can potentially corrupt model parameters. Given this challenge, this paper aims to answer a critical question: How likely is a parameter corruption to result in an incorrect model output? To systemati…

This https://arxiv.org/abs/2301.03835 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

A non-compact convex hull in generalized non-positive curvature
In this article, we are interested in metric spaces that satisfy a weak non-positive curvature condition in the sense that they admit a conical geodesic bicombing. We show that the analog of a question of Gromov about compactness properties of convex hulls has a negative answer in this setting. Specifically, we prove that there exists a complete metric space $X$ that admits a conical bicombing $σ$ such that $X$ has a finite subset whose closed $σ$-convex hull is not compact.

Vindman: Trump has ‘every intention’ to undo American democracy if reelected 
Retired Army Lt. Col. Alexander Vindman suggested Friday that President Trump has “every intention” to undo American democracy if reelected, as concerns rise over whether the former president would launch a revenge campaign in a second term.
“We might have only one more vote left that really matters,” Vindman said in an interview on MSNBC’s “The Last Word” with anchor Ali Velshi. “If Trump comes to off…

Vindman: Trump has ‘every intention’ to undo American democracy if reelected 
Retired Army Lt. Col. Alexander Vindman suggested Friday that President Trump has “every intention” to undo American democracy if reelected, as concerns rise over whether the former president would launch revenge campaign in a second term. “We might have only one more vote left that really matters,” Vindman said in an interview on MSNBC’s “The…

"By 1973, the first volume of the defining work of our craft, “The Art of Computer Programming” had been available in bookstores since 1968, and its first chapter literally consisted of a 100-something page long introduction to various mathematical concepts. Induction, logarithms, series, matrices, elementary number theory, permutations and factorials, Fibonacci numbers, are some of the subjects exposed in those beautifully typeset pages."

In Praise Of Mathematics
How much math knowledge does a programmer need to know to fulfill their job? How deep should the mathematical knowledge of full-stack engineers, computer security experts, or large language model engineers be? The spectrum of possible answers to these questions is too large to be useful. Perhaps the eternal answer "it depends" is enough?

Constructions of $t$-designs from weighing matrices and walk-regular graphs
Gary Greaves, Sho Suda
https://arxiv.org/abs/2402.17528 https://

Constructions of $t$-designs from weighing matrices and walk-regular graphs
We provide a method to construct $t$-designs from weighing matrices and walk-regular graphs. One instance of our method can produce a $3$-design from any (symmetric or skew-symmetric) conference matrix, thereby providing a partial answer to a question of Gunderson and Semeraro JCTB 2017. We explore variations of our method on some matrices that satisfy certain combinatorial restrictions. In particular, we show that there exist various infinite families of partially balanced incomplete blo…

The lesson from Turkey’s elections: Charisma is key to defeating a strongman
Charisma matters. Only a year ago, Turkey’s opposition failed to unseat Erdogan in general elections despite Turkey’s sputtering economy
— in large part because opposition parties settled on a dull compromise candidate, Kemal Kilicdaroglu.
With Imamoglu as the new hopeful alternative, the dynamic shifted against Erdogan.

A top adviser for Imamoglu told me that in Istanbul and Ankara, opposi…

The lesson from Turkey’s elections: Charisma is key to defeating a strongman
Erdogan’s party suffered a historic loss in this weekend’s elections. To preserve his legacy, Turkey’s strongman should step aside after his third term.

This https://arxiv.org/abs/2402.17944 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csCL_…

Large Language Models on Tabular Data -- A Survey
Recent breakthroughs in large language modeling have facilitated rigorous exploration of their application in diverse tasks related to tabular data modeling, such as prediction, tabular data synthesis, question answering, and table understanding. Each task presents unique challenges and opportunities. However, there is currently a lack of comprehensive review that summarizes and compares the key techniques, metrics, datasets, models, and optimization approaches in this research domain. This sur…

Constructions of $t$-designs from weighing matrices and walk-regular graphs
Gary Greaves, Sho Suda
https://arxiv.org/abs/2402.17528 https://

Constructions of $t$-designs from weighing matrices and walk-regular graphs
We provide a method to construct $t$-designs from weighing matrices and walk-regular graphs. One instance of our method can produce a $3$-design from any (symmetric or skew-symmetric) conference matrix, thereby providing a partial answer to a question of Gunderson and Semeraro JCTB 2017. We explore variations of our method on some matrices that satisfy certain combinatorial restrictions. In particular, we show that there exist various infinite families of partially balanced incomplete blo…

This https://arxiv.org/abs/2402.17944 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csCL_…

Large Language Models on Tabular Data -- A Survey
Recent breakthroughs in large language modeling have facilitated rigorous exploration of their application in diverse tasks related to tabular data modeling, such as prediction, tabular data synthesis, question answering, and table understanding. Each task presents unique challenges and opportunities. However, there is currently a lack of comprehensive review that summarizes and compares the key techniques, metrics, datasets, models, and optimization approaches in this research domain. This sur…